A Derivation of Huffman's Algorithm
نویسنده
چکیده
We present a semi-formal derivation of Hu:ffman's well-known algorithm for the construction of an optimal encoding tree.
منابع مشابه
Quasi-questionnaires, codes and Huffman's length
New concepts are defined, in particular the quasi-question or vertex with an outgoing arc of zero probability. A quasi-questionnaire is a probabilistic homogeneous (rooted) tree with quasiquestions. It is shown that every instantaneous code is a quasi-questionnaire with precise restrictive conditions; it may also be a questionnaire, without an arc of zero probability. Also, an approximation is ...
متن کاملNon-linear Fractional-Order Chaotic Systems Identification with Approximated Fractional-Order Derivative based on a Hybrid Particle Swarm Optimization-Genetic Algorithm Method
Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...
متن کاملThe Rényi redundancy of generalized Huffman codes
If optimality is measured by average codeword length, Huffman's algorithm gives optimal codes, and the redundancy can be measured as the difference between the average codeword length and Shannon's entropy. If the objective function is replaced by an exponentially weighted average, then a simple modification of Huffman's algorithm gives optimal codes. The redundancy can now be measured as the d...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملOn Jordan left derivations and generalized Jordan left derivations of matrix rings
Abstract. Let R be a 2-torsion free ring with identity. In this paper, first we prove that any Jordan left derivation (hence, any left derivation) on the full matrix ringMn(R) (n 2) is identically zero, and any generalized left derivation on this ring is a right centralizer. Next, we show that if R is also a prime ring and n 1, then any Jordan left derivation on the ring Tn(R) of all n×n uppe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992